Minimal Permutation Representations of Nilpotent Groups

نویسندگان

  • Ben Elias
  • Lior Silberman
  • Ramin Takloo-Bighash
چکیده

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In these situations (except when central involutions intervene) all minimal permutation representations have the same set of orbit sizes. Using the same ideas we also show that if the size d(G) of a minimal faithful G-set is at least c|G| for some c > 0 then d(G) = |G|/m + O(1) for an integer m, with the implied constant depending on c.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On minimal degrees of faithful quasi-permutation representations of nilpotent groups

By a quasi-permutation matrix, we mean a square non-singular matrix over the complex field with non-negative integral trace....

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...

متن کامل

Groups with Two Extreme Character Degrees and their Minimal Faithful Representations

for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...

متن کامل

MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Experimental Mathematics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2010